Non-Monotonic-Offers Bargaining Protocol

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Commitment in alternating offers bargaining

We extend the Ståhl-Rubinstein alternating-o¤er bargaining procedure to allow players, prior to each bargaining round, to simultaneously and visibly commit to some share of the pie. If commitment costs are small but increasing in the committed share, then the unique outcome consistent with common belief in future rationality (Perea, 2009), or more restrictively subgame perfect Nash equilibrium,...

متن کامل

Evolutionary Stability in Alternating-Offers Bargaining Gamesl

This paper characterizes modified evolutiona.rily stable strategies (MESSes) in Rubinstein’s alternating-offers, infinite-horizon bargaining game. The MESS concept modifies the idea of an neutrally stable strategy by favoring a simple strategy over a more complex strategy when both yield the same payoff. Our complexity notion is weaker than the common practice of counting states in automata. If...

متن کامل

Alternating offers bargaining with loss aversion

The Rubinstein alternating offers bargaining game is reconsidered under the assumption that each player is loss averse and the associated reference point is equal to the highest turned down offer of the opponent in the past. This makes the payoffs and therefore potential equilibrium strategies dependent on the history of play. A subgame perfect equilibrium is constructed, in which the strategie...

متن کامل

Bargaining with nonanonymous disagreement: Monotonic rules

We analyze bargaining situations where the agents’ payoffs from disagreement depend on who among them breaks down the negotiations. We model such problems as a superset of the standard domain of Nash (1950). On our extended domain, we analyze the implications of two central properties which, on the Nash domain, are known to be incompatible: strong monotonicity (Kalai, 1977) and scale invariance...

متن کامل

Bargaining in Bundle over Multiple Issues in Finite-Horizon Alternating-Offers Protocol

This paper provides an algorithm to compute the subgame perfect equilibrium strategies in perfect information finitehorizon alternating-offers bargaining in-bundle over multiple issues. We show that the agreement is achieved immediately and is Pareto efficient. We make a novel use of backward induction for multiple issues and we prove that, for linear multi-attribute utility functions, the prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Autonomous Agents and Multi-Agent Systems

سال: 2005

ISSN: 1387-2532,1573-7454

DOI: 10.1007/s10458-005-0984-1